Minimal constraints in the parity formulation of optimization problems
نویسندگان
چکیده
As a means to solve optimization problems using quantum computers, the problem is typically recast into Ising spin model whose ground-state solution of problem. An alternative formulation Lechner-Hauke-Zoller model, which has form lattice gauge with nearest neighbor 4-body constraints. Here we introduce method find minimal strength constraints are required conserve correct ground-state. Based on this, derive upper and lower bounds for strengths. We that depending class, exponent ranges from linear $\alpha \propto 1$ quadratic 2$ scaling number logical qubits.
منابع مشابه
Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints
Minimal partition problems describe the task of partitioning a domain into a set of meaningful regions. Two important examples are image segmentation and 3D reconstruction. They can both be formulated as energy minimization problems requiring minimum boundary length or surface area of the regions. This common prior often leads to the removal of thin or elongated structures. Volume constraints i...
متن کاملReliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملA New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems
One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...
متن کاملUnconstrained formulation of standard quadratic optimization problems
A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadra...
متن کاملQuartic Formulation of Standard Quadratic Optimization Problems
A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2021
ISSN: ['1367-2630']
DOI: https://doi.org/10.1088/1367-2630/ac1897